Analysing the Impact of Heterogeneity with Greedy Resource Allocation Algorithms for Dynamic Load Balancing in Heterogeneous Distributed Computing System
نویسندگان
چکیده
Heterogeneous Distributed systems have been an active research area in computer science for the last two decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i. e. the completion time at the maximum loaded computing node). This paper presents and discusses the dynamic load balancing problem on Heterogeneous Distributed Computing System (HDCS) and analyzes the impact of heterogeneity on computing capability of node on task allocation problem. Since the task assignment problem in NP hard, greedy heuristic algorithms are used to study the impact of heterogeneity on computing resources. The task model is presented as consistent ETC (Expected Time to Compute) matrix in four different heterogeneous computing environments to study the performance of heuristic algorithms to minimize the makespan.
منابع مشابه
Dynamic Load Balancing Strategies in Heterogeneous Distributed System
Distributed heterogeneous computing is being widely applied to a variety of large size computational problems. This computational environments are consists of multiple heterogeneous computing modules, these modules interact with each other to solve the problem. Dynamic load balancing in distributed computing system is desirable because it is an important key to establish dependability in a Hete...
متن کاملObserving the Performance of Greedy algorithms for dynamic load balancing in Heterogeneous Distributed Computing System
Distributed systems have been an active research area in computer science for the last decade, task allocation and load balancing have been a major issue associated with such systems. The load-balancing problem, attempts to compute the assignment with smallest possible makespan (i.e. the completion time at the maximum loaded computing node). Load balancing problem is a NP hard problem. This pap...
متن کاملAdaptive Dynamic Data Placement Algorithm for Hadoop in Heterogeneous Environments
Hadoop MapReduce framework is an important distributed processing model for large-scale data intensive applications. The current Hadoop and the existing Hadoop distributed file system’s rack-aware data placement strategy in MapReduce in the homogeneous Hadoop cluster assume that each node in a cluster has the same computing capacity and a same workload is assigned to each node. Default Hadoop d...
متن کاملLoad Balancing in Heterogeneous Distributed Computing Systems using Approximation Algorithm
Approximation algorithms have been used to design polynomial time algorithms for intractable problems that provide solutions within the bounded proximity of the optimal solution. Load balancing problem on Heterogeneous Distributed Computing System (HDCS) deals with allocation of tasks to computing nodes, so that computing nodes are evenly loaded. Load-balancing algorithms are attempts to comput...
متن کاملA Control-based Load Balancing Algorithm with Flow Control for Dynamic and Heterogeneous Servers
Although load balancing is a fundamental and well-studied problem in resource allocation, the ever changing scenarios and technologies in distributed systems demand new approaches and algorithms. In this context, we consider a real world scenario where servers are heterogeneous and have dynamic background loads not controlled by the load balancer. In such scenarios, classic round robin policy o...
متن کامل